Additively decomposed quasiconvex functions
نویسندگان
چکیده
منابع مشابه
The Factorized Distribution Algorithm for Additively Decomposed Functions
Published in: Proceedings of the 1999 Congress on Evolutionary Computation, 1999, IEEE Press, 752–759 AbstractFDA the Factorized Distribution Algorithm is an evolutionary algorithm that combines mutation and recombination by using a distribution. First the distribution is estimated from a set of selected points. It is then used to generate new points for the next generation. In general a distri...
متن کاملFDA - A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions
The Factorized Distribution Algorithm (FDA) is an evolutionary algorithm which combines mutation and recombination by using a distribution. The distribution is estimated from a set of selected points. In general, a discrete distribution defined for n binary variables has 2(n) parameters. Therefore it is too expensive to compute. For additively decomposed discrete functions (ADFs) there exist al...
متن کاملQuasiconvex functions and Hessian equations
In this note we construct new examples of quasiconvex functions defined on the set Sn×n of symmetric matrices. They are built on the k-th elementary symmetric function of the eigenvalues, k = 1, 2, ..., n. The idea is motivated by Šverák’s paper [S]. The proof of our result relies on the theory of the so-called k-Hessian equations, which have been intensively studied recently, see [CNS], [T], [...
متن کاملJensen’s Inequality for Quasiconvex Functions
This class of functions strictly contains the class of convex functions defined on a convex set in a real linear space. See [8] and citations therein for an overview of this issue. Some recent studies have shown that quasiconvex functions have quite close resemblances to convex functions – see, for example, [4], [6], [7], [10] for quasiconvex and even more general extensions of convex functions...
متن کاملQuasiconvex Functions and Nonlinear Pdes
A second order characterization of functions which have convex level sets (quasiconvex functions) results in the operator L0(Du,Du) = min{v ·D2u vT | |v| = 1, |v ·Du| = 0}. In two dimensions this is the mean curvature operator, and in any dimension L0(Du,Du)/|Du| is the first principal curvature of the surface S = u−1(c). Our main results include a comparison principle for L0(Du,Du) = g when g ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1982
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01585092